Ulysses: A Robust, Low-Diameter, Low-Latency Peer-to-Peer Network
نویسندگان
چکیده
A number of Distributed Hash Table (DHT)-based protocols have been proposed to address the issue of scalability in peer-topeer networks. However, it remains an open question whether there exists a DHT scheme that can achieve the theoretical lower bound of on network diameter when the average routing table size at nodes is no more than . In this paper, we present Ulysses, a peer-to-peer network based on the butterfly topology that matches this theoretical lower bound. Compared to existing DHT-based schemes with similar routing table size, Ulysses reduces the network diameter by a factor of , which is 2-4 for typical configurations. This translates into the same amount of reduction on query latency and average traffic per link/node. In addition, Ulysses maintains the same level of robustness in terms of routing in the face of faults and recovering from graceful/ungraceful joins/departures, as provided by existing DHT-based schemes. The protocol is formally verified for its correctness and robustness using techniques from distributed computing. The performance of the protocol has been evaluated using both analysis and simulation.
منابع مشابه
Ulysses: A Robust, Low-Diameter, Low-Latency Peer-ti-Peer Network
A number of Distributed Hash Table (DHT)-based protocols have been proposed to address the issue of scalability in peer-topeer networks. However, it remains an open question whether there exists a DHT scheme that can achieve the theoretical lower bound of on network diameter when the average routing table size at nodes is no more than . In this paper, we present Ulysses, a peer-to-peer network ...
متن کاملTAC: A Topology-Aware Chord-based Peer-to-Peer Network
Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...
متن کاملRandom Graphs for Peer-to-Peer Overlays
Modern peer-to-peer networks consist of several network layers and distributed algorithms providing features like indexing, ressource balancing, entry protocols, security, anonymity, and cryptography. Since peer-to-peer networks are highly dynamic, a fundamental task in the design of these networks is to provide high connectivity. We propose a solution by distributed random link exchange algori...
متن کاملConstructing a Balanced, (log(N)/loglog(N))-Diameter Super-Peer Topology for Scalable P2P Systems
Current peer-to-peer (P2P) file sharing applications are remarkably simple and robust, but their inefficiency can produce very high network loads. The use of superpeers has been proposed to improve the performance of unstructured P2P systems. These have the potential to approach the performance and scalability of structured systems, while retaining the benefits of unstructured P2P systems. Ther...
متن کامل